Research on AODV Routing Protocol based on Improved Genetic Algorithm and Ant Colony Algorithm
نویسندگان
چکیده
Aimed at the problems that classical ant colony algorithm is easy to fall into local optimal, this thesis puts forward a new AODV routing protocol based on improved geneticant colony algorithms (IGAACA-AODV) by introducing genetic algorithm (GA) to improve ant colony algorithm, and combining with the characteristics of AODV routing protocols in Ad Hoc network. First of all, the proposed algorithm takes advantage of the global quickly searching ability in genetic algorithm to obtain the optimization solution set of path and transforms it to the initial information pheromone distribution of ant colony algorithm. Then, the updating rules of pheromone in ant colony algorithm is improved; both the residual energy of nodes and the link delay in the process of searching path are taken into account synthetically. Finally, a reasonable and effective optimal path in an adaptive selected way is found by using the positive feedback characteristics and the capability of rapid search. Compared with the GA and Ant-AODV and the traditional AODV routing protocol, simulation results show that the new algorithm not only increases the search diversity of the path, but also reduces the average end-to-end delay. Meanwhile, this new algorithm may improve the data packet ratio and prolongs lifetime of network.
منابع مشابه
Improvement of Routing Operation Based on Learning with Using Smart Local and Global Agents and with the Help of the Ant Colony Algorithm
Routing in computer networks has played a special role in recent years. The cause of this is the role of routing in a performance of the networks. The quality of service and security is one of the most important challenges in routing due to lack of reliable methods. Routers use routing algorithms to find the best route to a particular destination. When talking about the best path, we consider p...
متن کاملMulticast computer network routing using genetic algorithm and ant colony
Due to the growth and development of computer networks, the importance of the routing topic has been increased. The importance of the use of multicast networks is not negligible nowadays. Many of multimedia programs need to use a communication link to send a packet from a sender to several receivers. To support such programs, there is a need to make an optimal multicast tree to indicate the opt...
متن کاملImprovement of Routing Operation Based on Learning with Using Smart Local and Global Agents and with the Help of the Ant Colony Algorithm
Routing in computer networks has played a special role in recent years. The cause of this is the role of routing in a performance of the networks. The quality of service and security is one of the most important challenges in routing due to lack of reliable methods. Routers use routing algorithms to find the best route to a particular destination. When talking about the best path, we consider p...
متن کاملCombining Harmony search algorithm and Ant Colony Optimization algorithm to increase the lifetime of Wireless Sensor Networks
Wireless Sensor Networks are the new generation of networks that typically are formed great numbers of nodes and the communications of these nodes are done as Wireless. The main goal of these networks is collecting data from neighboring environment of network sensors. Since the sensor nodes are battery operated and there is no possibility of charging or replacing the batteries, the lifetime of ...
متن کاملAnt Colony Algorithm for the Single Loop Routing Problem
In this paper, a new algorithm for solving the single loop routing problem is presented. The purpose of the single loop routing problem(SLRP) is to find the shortest loop for an automated guided vehicle covering at least one edge of each department of a block layout. First it shown that this problem can be represented as a graph model. Then a meta-heuristic algorithm based on and colony system ...
متن کامل